منابع مشابه
A set coverage problem
This paper shows that with B = {1, 2, . . . , n}, the smallest k such that (B ×B)− {(j, j) | j ∈ B} = k ⋃ i=1 (Ci ×Di) is s(n), where s(n) is the smallest integer k such that n 6 ( k b k 2 c ) . This provides a simple set-based formulation and a new proof of a result for boolean ranks [2] and biclique covering of bipartite graphs [1, 5], making these intricate results more accessible.
متن کاملorigins of armenia’s foreign policy and its foreign policy towards iran
foreign policy takes root from complicated matters. however, this issue may be more truth about armenia. although the new government of armenia is less than 20 years, people of this territory are the first ones who officially accepted christianity. in very past times, these people were a part of great emperors like iran, rome, and byzantium.armenia is regarded as a nation with a privileged hist...
15 صفحه اولThe Maximum Coverage Set Calculated Algorithm for WSN Area Coverage
The Coverage Control Technology is one of the basic technologies of wireless sensor network, and is mainly concerned about how to prolong the network lifetime on the basis of meeting users’ perception demand. Among this, in the study of area coverage, the set K-cover algorithm is broadly accepted because that it can prolong network lifetime rather well. However, maximum set covers problem is pr...
متن کاملRobust Geometric Computing and Optimal Visibility Coverage
1 2 Preface This book presents work in two of the most popular areas of geometric computation: Robust Geometric Computing and Optimal Visibility Coverage. Both areas have been extensively researched in recent years and attracted the attention of many researchers and developers in both the academic and the industrial worlds. The work we present here aims to contribute to this effort by providing...
متن کاملProblem Set 4 . Robust Mechanism / Robust Predictions
(a) Establish a necessary and su¢ cient condition for the ex post incentive compatibility of the e¢ cient allocation. Explicitly derive a transfer schedule that achieves the e¢ cient allocation with ex post incentive compatibility and ex post participation constraint (i.e. each bidder receives nonnegative net utility and to be precise zero net utility if s/he loses) in the direct revelation mec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2011
ISSN: 1556-5068
DOI: 10.2139/ssrn.1948689